A Framework for n-Dimensional Visibility Computations
نویسندگان
چکیده
This chapter introduces global visibility computation using Grassmann Algebra. Visibility computation is a fundamental task in computer graphics, as in many other scientific domains. While it is well understood in two dimensions, this does not remain true in higher dimensional spaces. Grassmann Algebra allows to think about visibility at a high level of abstraction, and to design a framework for solving visibility problems in any n-dimensional space, for n ≥ 2. Contrary to Stolfi’s framework which allows only the representation of real lines, it’s algebraic nature dealt naturally without any particular cases. This chapter shows how the space of lines can be defined as a projective space over the bivector vector space. Then line classification, a key point for the visibility computation, is achieved using the exterior product. Actually, line classification turns out to be equivalent to point vs. hyperplane classification relatively to a nondegenerate bilinear form. This ensures well-defined property and computationally robustness. Using the previous result, the lines stabbing a n-dimensional convex face are characterized. This set of lines appears to be the intersection of the decomposable bivectors set (i.e. bivectors that represent a line) and a convex polytope. Moreover, this convex polytope is proved to be minimal. This property allows useful algorithmic improvements. To illustrate the use of our framework in practice, we present the computation of soft shadows for 3-dimensional illuminated scene. Lilian Aveneau XLIM/SIC, CNRS, University of Poitiers, France, e-mail: [email protected] Sylvain Charneau XLIM/SIC, CNRS, University of Poitiers, France e-mail: [email protected] Laurent Fuchs XLIM/SIC, CNRS, University of Poitiers, France e-mail: [email protected] Frédéric Mora XLIM/SIC, CNRS, University of Limoges, France e-mail: [email protected]
منابع مشابه
Multi-Dimensional Simulation of n-Heptane Combustion under HCCI Engine Condition Using Detailed Chemical Kinetics
In this study, an in-house multi-dimensional code has been developed which simulates the combustion of n-heptane in a Homogeneous Charge Compression Ignition (HCCI) engine. It couples the flow field computations with detailed chemical kinetic scheme which involves the multi-reactions equations. A chemical kinetic scheme solver has been developed and coupled for solving the chemical reactions an...
متن کاملTechnical Report Lazy visibility evaluation for exact soft shadows
This report presents a novel approach to compute high quality and alias-free soft shadows using exact visibility computations. This work relies on a theoritical framework allowing to group lines according to the geometry they intersect. From this study, we derive a new algorithm encoding lazily the visibility from a polygon. Contrary to previous works on from-polygon visibility, our approach is...
متن کاملVisibility-Based Pursuit-Evasion in Three-Dimensional Environments
The problem of visibility-based pursuit-evasion was first introduced in 1992 by Suzuki and Yamashita [19]. Since then, it has attracted considerable attention in the communities of robot motion planning and computational geometry. Researchers have considered many variations of the problem, including curved environments[11]; pursuers equipped with one or two “flashlights”, or rays of visibility[...
متن کاملProbabilistic Visibility Evaluation for Direct Illumination
The efficient evaluation of visibility in a three-dimensional scene is a longstanding problem in computer graphics. Visibility evaluations come in many different forms: figuring out what object is visible in a pixel; determining whether a point is visible to a light source; or evaluating the mutual visibility between 2 surface points. This paper provides a new, experimental view on visibility, ...
متن کامل